/**
 * @author LKQ
 * @date 2022/1/11 16:54
 * @description
 */
public class Solution {
    public static void main(String[] args) {

    }
    public int[] countPoints(int[][] points, int[][] queries) {
        int n = queries.length;
        int[] ans = new int[n];
        for (int i = 0; i < n; i++) {
            int x = queries[i][0], y = queries[i][1], r = queries[i][2];
            for (int j = 0; j < points.length; j++) {
                int x0 = points[j][0], y0 = points[j][1];
                if ((x - x0) * (x - x0) + (y - y0) * (y - y0) <= r * r) {
                    ans[i]++;
                }
            }
        }
        return ans;
    }
}
